Signal Transition Graph Constraints for Synthesis of Hazard-Free Asynchronous Circuits with Unbounded-Gate Delays
نویسندگان
چکیده
A synthesis procedure for asynchronous control circuits from a high level speci cation signal transition graph STG is described In this paper we propose some syntactic constraints on STG to guarantee hazard free im plementation We have introduced a global persistency concept in order to establish the relationship between the persistency concept introduced by Chu which we call local persistency and the consistent state coding CSC The STG syntactic constraints required to compute the input set of a signal are identi ed We analyze all hazards under both single and multiple input change conditions and propose necessary changes to the net contraction and logic synthesis procedures The proposed changes are guaranteed to generate hazard free circuits with the unbounded gate delay model if the STG is live safe and has consistent state coding
منابع مشابه
Signal Transition Graph Constraints for Synthesis
A synthesis procedure for asynchronous control circuits from a high level speci cation, signal transition graph (STG), is described. In this paper, we propose some syntactic constraints on STG to guarantee hazard-free implementation. We have introduced a global persistency concept in order to establish the relationship between the persistency concept introduced by Chu [2] (which we call local p...
متن کاملDesign of Asynchronous Circuits Assuming Unbounded Gate Delays
This paper considers the general problem of the synthesis of asynchronous combinational and sequential circuits based on the assumption that gate delays may be unbounded and that line delays are suitably constrained. Certain problems inherent to circuit realizations with unbounded gate delays are discussed and methods of solving them are proposed. Specific synthesis techniques are presented for...
متن کاملPetrify: a Tool for Manipulating Concurrent Speciications and Synthesis of Asynchronous Controllers
Petrify is a tool for (1) manipulating concurrent speciications and (2) synthesis and optimization of asynchronous control circuits. Given a Petri Net (PN), a Signal Transition Graph (STG), or a Transition System (TS) 1 it (1) generates another PN or STG which is simpler than the original description and (2) produces an optimized net-list of an asynchronous controller in the target gate library...
متن کاملPolynomial Algorithms for the Synthesis of Hazard-free Circuits from Signal Transition Graphs
Methods for the synthesis of asynchronous circuits from Signal Transition Graphs (STGs) have commonly used the State Graph to solve the two main steps of this process: the state assignment problem and the generation of hazard-free logic. The size of the State Graph can be of order O(2 n), where n is the number of signals of the circuit. As synthesis tools for asynchronous systems start to matur...
متن کاملPolynomial Algorithms for Complete State Coding and Synthesis of Hazard-free Circuits from Signal Transition Graphs
Methods for the synthesis of asynchronous circuits from Signal Transition Graphs (STGs) have commonly used the State Graph to solve the two main steps of this process: the state assignment problem and the generation of hazard-free logic. The size of the State Graph can be of order O(2 n), where n is the number of signals of the circuit. As synthesis tools for asynchronous systems start to matur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Formal Methods in System Design
دوره 5 شماره
صفحات -
تاریخ انتشار 1994